________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:16:52
Input Data from:  dataset110.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :100
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,14
Average f[i]   :3850
Average g[i,j] :2085,71428571429
Total demand   :5780
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	1880	1	-1	5	6500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  0    >new incumb.: 1880


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 34
> Selected Move:	2530	1	-1	9	12500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  0  1    >new incumb.: 2530


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 34
> Selected Move:	3070	1	-1	3	18000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1    >new incumb.: 3070


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 37
> Selected Move:	2800	3	5	6	17000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 37
> Selected Move:	2800	3	1	4	19400


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 24
> Selected Move:	2800	4	4	3	19300


> New Y[]: 
	
	 2  0  4  3  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 23
> Selected Move:	2800	4	3	6	18700


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 25
> Selected Move:	2930	3	6	5	18800


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 24
> Selected Move:	2930	4	5	9	19500


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 24
> Selected Move:	2800	3	5	6	18500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 27
> Selected Move:	2740	3	6	8	18000


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 29
> Selected Move:	2740	4	9	3	18800


> New Y[]: 
	
	 2  0  4  3  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 27
> Selected Move:	2789	3	8	5	20300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 22
> Selected Move:	2744	4	3	4	20400


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 26
> Selected Move:	2740	3	5	8	18900


> New Y[]: 
	
	 2  0  4  1  3  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 25
> Selected Move:	2740	4	4	8	19300


> New Y[]: 
	
	 2  0  4  1  1  0  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 26
> Selected Move:	2510	3	9	5	19800


> New Y[]: 
	
	 2  0  4  1  1  1  0  0  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 27
> Selected Move:	2670	3	8	6	19200


> New Y[]: 
	
	 2  0  4  1  1  1  3  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 29
> Selected Move:	2690	3	3	9	19700


> New Y[]: 
	
	 2  0  4  0  1  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 24
> Selected Move:	2700	3	6	1	18000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 30
> Selected Move:	2690	3	4	6	18000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 36
> Selected Move:	2670	3	9	3	17500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 36
> Selected Move:	2740	3	2	9	19700


> New Y[]: 
	
	 2  3  0  1  0  1  1  0  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 20
> Selected Move:	2740	4	9	5	19000


> New Y[]: 
	
	 2  3  0  1  0  4  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	3	3	4	19000


> New Y[]: 
	
	 2  3  0  0  1  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 23
> Selected Move:	2610	4	5	9	19700


> New Y[]: 
	
	 2  3  0  0  1  1  1  0  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 25
> Selected Move:	2540	3	9	3	20000


> New Y[]: 
	
	 2  3  0  4  1  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 14
> Selected Move:	2543	3	4	9	20500


> New Y[]: 
	
	 2  3  0  4  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 17
> Selected Move:	2610	3	5	7	18500


> New Y[]: 
	
	 2  3  0  4  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 23
> Selected Move:	2610	4	3	6	18500


> New Y[]: 
	
	 2  3  0  1  0  0  4  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 24
> Selected Move:	2610	4	6	7	18700


> New Y[]: 
	
	 2  3  0  1  0  0  1  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 21
> Selected Move:	2610	4	7	9	17700


> New Y[]: 
	
	 2  3  0  1  0  0  1  1  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 26
> Selected Move:	2590	3	7	8	18200


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 25
> Selected Move:	2590	4	9	3	19000


> New Y[]: 
	
	 2  3  0  4  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 21
> Selected Move:	2590	4	3	6	19000


> New Y[]: 
	
	 2  3  0  1  0  0  4  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 22
> Selected Move:	2740	3	6	2	16500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 37
> Selected Move:	2540	3	3	6	16500


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 37
> Selected Move:	2530	3	6	5	17500


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 35
> Selected Move:	2530	3	1	4	19900


> New Y[]: 
	
	 2  0  4  0  3  1  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 27
> Selected Move:	2556	3	8	6	20400


> New Y[]: 
	
	 2  0  4  0  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 21
> Selected Move:	2690	4	4	5	18800


> New Y[]: 
	
	 2  0  4  0  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 28
> Selected Move:	2690	4	5	9	19500


> New Y[]: 
	
	 2  0  4  0  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,32

## ITERATION 42 #######################


> Neighbours evaluated; 27
> Selected Move:	2670	3	4	3	19500


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 43 #######################


> Neighbours evaluated; 27
> Selected Move:	2670	4	9	5	18800


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 44 #######################


> Neighbours evaluated; 27
> Selected Move:	2670	4	5	6	19700


> New Y[]: 
	
	 2  0  4  1  0  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,305

## ITERATION 45 #######################


> Neighbours evaluated; 24
> Selected Move:	2579	4	6	3	20300


> New Y[]: 
	
	 2  0  4  3  0  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 46 #######################


> Neighbours evaluated; 23
> Selected Move:	2670	3	9	4	19800


> New Y[]: 
	
	 2  0  4  3  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,295

## ITERATION 47 #######################


> Neighbours evaluated; 28
> Selected Move:	2670	4	3	4	19900


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,29

## ITERATION 48 #######################


> Neighbours evaluated; 26
> Selected Move:	2670	4	4	5	18300


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,285

## ITERATION 49 #######################


> Neighbours evaluated; 28
> Selected Move:	2598	3	2	9	20500


> New Y[]: 
	
	 2  0  0  1  1  3  1  0  0  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,28

## ITERATION 50 #######################


> Neighbours evaluated; 25
> Selected Move:	2600	4	5	9	20500


> New Y[]: 
	
	 2  0  0  1  1  4  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,275

## ITERATION 51 #######################


> Neighbours evaluated; 23
> Selected Move:	2548	4	9	6	20700


> New Y[]: 
	
	 2  0  0  1  1  4  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,27

## ITERATION 52 #######################


> Neighbours evaluated; 25
> Selected Move:	2500	3	3	7	19700


> New Y[]: 
	
	 2  0  0  0  1  4  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 53 #######################


> Neighbours evaluated; 27
> Selected Move:	2500	4	6	9	19500


> New Y[]: 
	
	 2  0  0  0  1  4  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 54 #######################


> Neighbours evaluated; 28
> Selected Move:	2500	4	5	9	19500


> New Y[]: 
	
	 2  0  0  0  1  3  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 55 #######################


> Neighbours evaluated; 27
> Selected Move:	2500	4	9	4	20000


> New Y[]: 
	
	 2  0  0  0  4  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 56 #######################


> Neighbours evaluated; 27
> Selected Move:	2490	3	7	3	21000


> New Y[]: 
	
	 2  0  0  1  4  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 57 #######################


> Neighbours evaluated; 24
> Selected Move:	2480	3	9	7	19500


> New Y[]: 
	
	 2  0  0  1  4  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,24

## ITERATION 58 #######################


> Neighbours evaluated; 26
> Selected Move:	2480	4	4	3	19800


> New Y[]: 
	
	 2  0  0  4  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 59 #######################


> Neighbours evaluated; 26
> Selected Move:	2480	4	3	5	19800


> New Y[]: 
	
	 2  0  0  3  1  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 60 #######################


> Neighbours evaluated; 25
> Selected Move:	2480	4	3	4	19900


> New Y[]: 
	
	 2  0  0  1  3  4  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 61 #######################


> Neighbours evaluated; 25
> Selected Move:	2480	4	4	6	19200


> New Y[]: 
	
	 2  0  0  1  1  4  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,22

## ITERATION 62 #######################


> Neighbours evaluated; 26
> Selected Move:	2480	4	5	6	19800


> New Y[]: 
	
	 2  0  0  1  1  3  4  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,215

## ITERATION 63 #######################


> Neighbours evaluated; 25
> Selected Move:	2480	4	6	7	20000


> New Y[]: 
	
	 2  0  0  1  1  3  1  4  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,21

## ITERATION 64 #######################


> Neighbours evaluated; 26
> Selected Move:	2395	3	3	9	20500


> New Y[]: 
	
	 2  0  0  0  1  3  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 65 #######################


> Neighbours evaluated; 25
> Selected Move:	2474	3	7	3	21300


> New Y[]: 
	
	 2  0  0  4  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,2

## ITERATION 66 #######################


> Neighbours evaluated; 22
> Selected Move:	2480	4	3	5	21300


> New Y[]: 
	
	 2  0  0  3  1  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 67 #######################


> Neighbours evaluated; 20
> Selected Move:	2467	4	3	4	21400


> New Y[]: 
	
	 2  0  0  1  3  4  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,19

## ITERATION 68 #######################


> Neighbours evaluated; 21
> Selected Move:	2424	3	3	7	20400


> New Y[]: 
	
	 2  0  0  0  3  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,195

## ITERATION 69 #######################


> Neighbours evaluated; 24
> Selected Move:	2500	3	4	1	18000


> New Y[]: 
	
	 2  3  0  0  0  4  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 70 #######################


> Neighbours evaluated; 31
> Selected Move:	2520	3	6	3	18000


> New Y[]: 
	
	 2  3  0  1  0  4  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 71 #######################


> Neighbours evaluated; 30
> Selected Move:	2520	4	5	3	19500


> New Y[]: 
	
	 2  3  0  4  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 72 #######################


> Neighbours evaluated; 25
> Selected Move:	2530	3	3	2	17000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 73 #######################


> Neighbours evaluated; 35
> Selected Move:	2533	1	-1	3	22500


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 74 #######################


> Neighbours evaluated; 35
> Selected Move:	2520	4	2	7	19700


> New Y[]: 
	
	 2  3  0  1  0  1  0  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 75 #######################


> Neighbours evaluated; 24
> Selected Move:	2628	3	7	6	20500


> New Y[]: 
	
	 2  3  0  1  0  1  4  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 76 #######################


> Neighbours evaluated; 23
> Selected Move:	2540	3	9	4	20000


> New Y[]: 
	
	 2  3  0  1  1  1  4  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,225

## ITERATION 77 #######################


> Neighbours evaluated; 15
> Selected Move:	2540	4	6	4	19700


> New Y[]: 
	
	 2  3  0  1  4  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,22

## ITERATION 78 #######################


> Neighbours evaluated; 15
> Selected Move:	2566	3	3	9	20200


> New Y[]: 
	
	 2  3  0  0  4  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 79 #######################


> Neighbours evaluated; 21
> Selected Move:	2503	4	4	6	20500


> New Y[]: 
	
	 2  3  0  0  1  1  4  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 80 #######################


> Neighbours evaluated; 21
> Selected Move:	2500	3	4	7	19500


> New Y[]: 
	
	 2  3  0  0  0  1  4  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 81 #######################


> Neighbours evaluated; 27
> Selected Move:	2500	4	6	7	19700


> New Y[]: 
	
	 2  3  0  0  0  1  1  4  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 82 #######################


> Neighbours evaluated; 26
> Selected Move:	2500	4	7	9	18700


> New Y[]: 
	
	 2  3  0  0  0  1  1  1  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 83 #######################


> Neighbours evaluated; 29
> Selected Move:	2520	3	6	3	18700


> New Y[]: 
	
	 2  3  0  1  0  1  0  1  0  4 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 84 #######################


> Neighbours evaluated; 27
> Selected Move:	2510	3	9	2	16500


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 85 #######################


> Neighbours evaluated; 36
> Selected Move:	2540	3	7	4	17500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  1  0  0  0  0 
 > pw :0,18

## ITERATION 86 #######################


> Neighbours evaluated; 33
> Selected Move:	2520	3	0	6	19400


> New Y[]: 
	
	 0  3  4  1  1  1  2  0  0  0 


> New S[]: 
	
	 0  0  0  1  0  1  0  0  0  0 
 > pw :0,175

## ITERATION 87 #######################


> Neighbours evaluated; 18
> Selected Move:	2670	3	4	9	19900


> New Y[]: 
	
	 0  3  4  1  0  1  2  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,17

## ITERATION 88 #######################


> Neighbours evaluated; 25
> Selected Move:	2670	4	6	5	18900


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 89 #######################


> Neighbours evaluated; 25
> Selected Move:	2670	4	5	9	19500


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 90 #######################


> Neighbours evaluated; 24
> Selected Move:	2654	4	9	3	20100


> New Y[]: 
	
	 0  3  4  2  0  1  1  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 91 #######################


> Neighbours evaluated; 30
> Selected Move:	2520	3	3	4	19500


> New Y[]: 
	
	 0  3  4  0  2  1  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,15

## ITERATION 92 #######################


> Neighbours evaluated; 22
> Selected Move:	2520	4	4	5	18900


> New Y[]: 
	
	 0  3  4  0  1  2  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,145

## ITERATION 93 #######################


> Neighbours evaluated; 27
> Selected Move:	2520	4	5	6	19900


> New Y[]: 
	
	 0  3  4  0  1  1  2  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,14

## ITERATION 94 #######################


> Neighbours evaluated; 19
> Selected Move:	2520	4	6	9	19500


> New Y[]: 
	
	 0  3  4  0  1  1  1  0  0  2 


> New S[]: 
	
	 0  0  0  0  0  1  0  0  0  1 
 > pw :0,135

## ITERATION 95 #######################


> Neighbours evaluated; 26
> Selected Move:	2520	3	9	0	17500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,13

## ITERATION 96 #######################


> Neighbours evaluated; 29
> Selected Move:	2670	1	-1	3	23000


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,125

## ITERATION 97 #######################


> Neighbours evaluated; 30
> Selected Move:	2793	3	4	9	23500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,12

## ITERATION 98 #######################


> Neighbours evaluated; 23
> Selected Move:	2840	3	5	8	22000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,115

## ITERATION 99 #######################


> Neighbours evaluated; 34
> Selected Move:	2773	3	8	4	22500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,12

## ITERATION 100 #######################


> Neighbours evaluated; 32
> Selected Move:	2730	3	6	5	23500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,125

## ITERATION 101 #######################


> Neighbours evaluated; 30
> Selected Move:	2710	3	5	8	22000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,13

## ITERATION 102 #######################


> Neighbours evaluated; 31
> Selected Move:	2680	3	4	5	23000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,135

## ITERATION 103 #######################


> Neighbours evaluated; 33
> Selected Move:	2605	3	5	7	21000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,14

## ITERATION 104 #######################


> Neighbours evaluated; 35
> Selected Move:	2590	3	8	6	21500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,145

## ITERATION 105 #######################


> Neighbours evaluated; 31
> Selected Move:	2533	3	2	5	23500


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 106 #######################


> Neighbours evaluated; 29
> Selected Move:	2480	4	0	6	19900


> New Y[]: 
	
	 0  3  0  1  0  4  2  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 107 #######################


> Neighbours evaluated; 27
> Selected Move:	2480	4	6	9	19500


> New Y[]: 
	
	 0  3  0  1  0  4  1  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 108 #######################


> Neighbours evaluated; 28
> Selected Move:	2480	4	5	9	19600


> New Y[]: 
	
	 0  3  0  1  0  2  1  1  0  4 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,165

## ITERATION 109 #######################


> Neighbours evaluated; 26
> Selected Move:	2414	4	9	3	20400


> New Y[]: 
	
	 0  3  0  4  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,17

## ITERATION 110 #######################


> Neighbours evaluated; 25
> Selected Move:	2463	4	3	5	20100


> New Y[]: 
	
	 0  3  0  2  0  4  1  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,175

## ITERATION 111 #######################


> Neighbours evaluated; 24
> Selected Move:	2340	4	3	7	20800


> New Y[]: 
	
	 0  3  0  1  0  4  1  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 112 #######################


> Neighbours evaluated; 24
> Selected Move:	2372	4	5	7	20600


> New Y[]: 
	
	 0  3  0  1  0  2  1  4  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,185

## ITERATION 113 #######################


> Neighbours evaluated; 20
> Selected Move:	2406	4	7	6	20400


> New Y[]: 
	
	 0  3  0  1  0  2  4  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 114 #######################


> Neighbours evaluated; 22
> Selected Move:	2350	3	6	2	17900


> New Y[]: 
	
	 0  3  4  1  0  2  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 115 #######################


> Neighbours evaluated; 33
> Selected Move:	2350	4	5	3	19100


> New Y[]: 
	
	 0  3  4  2  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,2

## ITERATION 116 #######################


> Neighbours evaluated; 30
> Selected Move:	2350	4	3	7	19800


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  0  1 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,205

## ITERATION 117 #######################


> Neighbours evaluated; 29
> Selected Move:	2350	4	7	9	18500


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  2 


> New S[]: 
	
	 0  1  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 118 #######################


> Neighbours evaluated; 30
> Selected Move:	2320	3	7	8	19000


> New Y[]: 
	
	 0  3  4  1  0  1  0  0  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 119 #######################


> Neighbours evaluated; 32
> Selected Move:	2510	3	9	0	17000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 120 #######################


> Neighbours evaluated; 33
> Selected Move:	2510	3	1	4	19400


> New Y[]: 
	
	 2  0  4  1  3  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 121 #######################


> Neighbours evaluated; 29
> Selected Move:	2510	4	4	3	19300


> New Y[]: 
	
	 2  0  4  3  1  1  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 122 #######################


> Neighbours evaluated; 30
> Selected Move:	2530	3	3	9	19000


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 123 #######################


> Neighbours evaluated; 29
> Selected Move:	2530	4	9	5	18300


> New Y[]: 
	
	 2  0  4  0  1  3  0  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 124 #######################


> Neighbours evaluated; 30
> Selected Move:	2530	3	8	7	17800


> New Y[]: 
	
	 2  0  4  0  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 125 #######################


> Neighbours evaluated; 32
> Selected Move:	2530	4	5	4	19400


> New Y[]: 
	
	 2  0  4  0  3  1  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 126 #######################


> Neighbours evaluated; 29
> Selected Move:	2530	4	4	9	18500


> New Y[]: 
	
	 2  0  4  0  1  1  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 127 #######################


> Neighbours evaluated; 29
> Selected Move:	2513	4	9	7	20100


> New Y[]: 
	
	 2  0  4  0  1  1  0  3  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 128 #######################


> Neighbours evaluated; 29
> Selected Move:	2479	3	7	8	20300


> New Y[]: 
	
	 2  0  4  0  1  1  0  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,165

## ITERATION 129 #######################


> Neighbours evaluated; 26
> Selected Move:	2490	3	5	6	19300


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,16

## ITERATION 130 #######################


> Neighbours evaluated; 30
> Selected Move:	2520	3	8	1	17000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,155

## ITERATION 131 #######################


> Neighbours evaluated; 27
> Selected Move:	2558	1	-1	5	23500


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,15

## ITERATION 132 #######################


> Neighbours evaluated; 20
> Selected Move:	2500	3	5	8	22000


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,145

## ITERATION 133 #######################


> Neighbours evaluated; 31
> Selected Move:	2583	3	9	3	21500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,15

## ITERATION 134 #######################


> Neighbours evaluated; 36
> Selected Move:	2555	3	1	9	23500


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 135 #######################


> Neighbours evaluated; 30
> Selected Move:	2559	4	2	4	20200


> New Y[]: 
	
	 2  0  0  1  4  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 136 #######################


> Neighbours evaluated; 28
> Selected Move:	2526	4	9	6	20400


> New Y[]: 
	
	 2  0  0  1  4  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,165

## ITERATION 137 #######################


> Neighbours evaluated; 25
> Selected Move:	2590	4	4	9	19900


> New Y[]: 
	
	 2  0  0  1  1  0  3  0  1  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 138 #######################


> Neighbours evaluated; 28
> Selected Move:	2505	4	6	3	20500


> New Y[]: 
	
	 2  0  0  3  1  0  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 139 #######################


> Neighbours evaluated; 27
> Selected Move:	2503	4	3	9	20500


> New Y[]: 
	
	 2  0  0  4  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 140 #######################


> Neighbours evaluated; 24
> Selected Move:	2500	4	3	6	20500


> New Y[]: 
	
	 2  0  0  1  1  0  4  0  1  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,185

## ITERATION 141 #######################


> Neighbours evaluated; 25
> Selected Move:	2430	3	8	7	20000


> New Y[]: 
	
	 2  0  0  1  1  0  4  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,19

## ITERATION 142 #######################


> Neighbours evaluated; 28
> Selected Move:	2430	4	6	3	20000


> New Y[]: 
	
	 2  0  0  4  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,195

## ITERATION 143 #######################


> Neighbours evaluated; 26
> Selected Move:	2430	4	3	4	19700


> New Y[]: 
	
	 2  0  0  1  4  0  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,2

## ITERATION 144 #######################


> Neighbours evaluated; 24
> Selected Move:	2480	3	4	5	19500


> New Y[]: 
	
	 2  0  0  1  0  4  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 145 #######################


> Neighbours evaluated; 26
> Selected Move:	2480	4	5	9	19500


> New Y[]: 
	
	 2  0  0  1  0  3  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 146 #######################


> Neighbours evaluated; 24
> Selected Move:	2430	3	6	4	19500


> New Y[]: 
	
	 2  0  0  1  1  3  0  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 147 #######################


> Neighbours evaluated; 26
> Selected Move:	2430	4	5	9	19500


> New Y[]: 
	
	 2  0  0  1  1  4  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,19

## ITERATION 148 #######################


> Neighbours evaluated; 23
> Selected Move:	2373	4	9	3	20300


> New Y[]: 
	
	 2  0  0  3  1  4  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,185

## ITERATION 149 #######################


> Neighbours evaluated; 26
> Selected Move:	2425	3	4	6	20300


> New Y[]: 
	
	 2  0  0  3  0  4  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,18

## ITERATION 150 #######################


> Neighbours evaluated; 24
> Selected Move:	2480	4	3	6	19700


> New Y[]: 
	
	 2  0  0  1  0  4  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,175

## ITERATION 151 #######################


> Neighbours evaluated; 24
> Selected Move:	2430	3	5	4	19900


> New Y[]: 
	
	 2  0  0  1  4  0  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,17

## ITERATION 152 #######################


> Neighbours evaluated; 27
> Selected Move:	2430	4	4	9	19400


> New Y[]: 
	
	 2  0  0  1  1  0  3  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,165

## ITERATION 153 #######################


> Neighbours evaluated; 23
> Selected Move:	2509	3	7	5	21400


> New Y[]: 
	
	 2  0  0  1  1  1  3  0  0  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 154 #######################


> Neighbours evaluated; 24
> Selected Move:	2436	4	9	4	21900


> New Y[]: 
	
	 2  0  0  1  4  1  3  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 155 #######################


> Neighbours evaluated; 21
> Selected Move:	2477	4	6	9	21700


> New Y[]: 
	
	 2  0  0  1  4  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 156 #######################


> Neighbours evaluated; 22
> Selected Move:	2420	4	4	3	22000


> New Y[]: 
	
	 2  0  0  4  1  1  1  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,165

## ITERATION 157 #######################


> Neighbours evaluated; 22
> Selected Move:	2410	4	3	6	22000


> New Y[]: 
	
	 2  0  0  1  1  1  4  0  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,17

## ITERATION 158 #######################


> Neighbours evaluated; 19
> Selected Move:	2519	4	9	5	21300


> New Y[]: 
	
	 2  0  0  1  1  3  4  0  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,175

## ITERATION 159 #######################


> Neighbours evaluated; 23
> Selected Move:	2448	3	3	7	20300


> New Y[]: 
	
	 2  0  0  0  1  3  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,18

## ITERATION 160 #######################


> Neighbours evaluated; 22
> Selected Move:	2426	3	4	3	20300


> New Y[]: 
	
	 2  0  0  1  0  3  4  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,185

## ITERATION 161 #######################


> Neighbours evaluated; 23
> Selected Move:	2430	3	6	4	20000


> New Y[]: 
	
	 2  0  0  1  4  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,19

## ITERATION 162 #######################


> Neighbours evaluated; 24
> Selected Move:	2373	4	4	3	20300


> New Y[]: 
	
	 2  0  0  4  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,195

## ITERATION 163 #######################


> Neighbours evaluated; 22
> Selected Move:	2422	3	4	6	20300


> New Y[]: 
	
	 2  0  0  4  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,2

## ITERATION 164 #######################


> Neighbours evaluated; 21
> Selected Move:	2380	4	3	7	20500


> New Y[]: 
	
	 2  0  0  1  0  3  1  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,205

## ITERATION 165 #######################


> Neighbours evaluated; 22
> Selected Move:	2328	3	6	4	20500


> New Y[]: 
	
	 2  0  0  1  1  3  0  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,21

## ITERATION 166 #######################


> Neighbours evaluated; 22
> Selected Move:	2346	3	5	6	20400


> New Y[]: 
	
	 2  0  0  1  1  0  3  4  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,215

## ITERATION 167 #######################


> Neighbours evaluated; 25
> Selected Move:	2387	4	6	9	20200


> New Y[]: 
	
	 2  0  0  1  1  0  1  4  0  3 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,22

## ITERATION 168 #######################


> Neighbours evaluated; 23
> Selected Move:	2392	3	7	8	20900


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  4  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,225

## ITERATION 169 #######################


> Neighbours evaluated; 22
> Selected Move:	2365	4	8	9	21000


> New Y[]: 
	
	 2  0  0  1  1  0  1  0  3  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,23

## ITERATION 170 #######################


> Neighbours evaluated; 22
> Selected Move:	2452	4	8	4	20600


> New Y[]: 
	
	 2  0  0  1  3  0  1  0  1  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,235

## ITERATION 171 #######################


> Neighbours evaluated; 23
> Selected Move:	2407	3	8	7	20100


> New Y[]: 
	
	 2  0  0  1  3  0  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,24

## ITERATION 172 #######################


> Neighbours evaluated; 22
> Selected Move:	2430	4	4	3	20000


> New Y[]: 
	
	 2  0  0  3  1  0  1  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0 
 > pw :0,245

## ITERATION 173 #######################


> Neighbours evaluated; 23
> Selected Move:	2330	3	6	8	19500


> New Y[]: 
	
	 2  0  0  3  1  0  0  1  1  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,25

## ITERATION 174 #######################


> Neighbours evaluated; 26
> Selected Move:	2330	4	3	4	19600


> New Y[]: 
	
	 2  0  0  1  3  0  0  1  1  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,255

## ITERATION 175 #######################


> Neighbours evaluated; 24
> Selected Move:	2330	4	4	8	20000


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  3  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 176 #######################


> Neighbours evaluated; 20
> Selected Move:	2330	4	8	9	19900


> New Y[]: 
	
	 2  0  0  1  1  0  0  1  4  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,265

## ITERATION 177 #######################


> Neighbours evaluated; 20
> Selected Move:	2350	3	8	2	17500


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,26

## ITERATION 178 #######################


> Neighbours evaluated; 28
> Selected Move:	2390	3	9	5	17300


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,255

## ITERATION 179 #######################


> Neighbours evaluated; 29
> Selected Move:	2510	3	7	8	17800


> New Y[]: 
	
	 2  0  4  1  1  3  0  0  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 180 #######################


> Neighbours evaluated; 27
> Selected Move:	2370	3	5	6	17700


> New Y[]: 
	
	 2  0  4  1  1  0  3  0  1  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,245

## ITERATION 181 #######################


> Neighbours evaluated; 30
> Selected Move:	2490	3	3	9	18200


> New Y[]: 
	
	 2  0  4  0  1  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,24

## ITERATION 182 #######################


> Neighbours evaluated; 28
> Selected Move:	2490	4	6	4	18900


> New Y[]: 
	
	 2  0  4  0  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,235

## ITERATION 183 #######################


> Neighbours evaluated; 26
> Selected Move:	2490	4	4	9	18000


> New Y[]: 
	
	 2  0  4  0  1  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 25
> Selected Move:	2370	3	4	3	18000


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  1  3 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,225

## ITERATION 185 #######################


> Neighbours evaluated; 28
> Selected Move:	2370	4	9	3	18800


> New Y[]: 
	
	 2  0  4  3  0  0  1  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,22

## ITERATION 186 #######################


> Neighbours evaluated; 28
> Selected Move:	2370	4	3	6	18200


> New Y[]: 
	
	 2  0  4  1  0  0  3  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 187 #######################


> Neighbours evaluated; 25
> Selected Move:	2370	4	6	8	19300


> New Y[]: 
	
	 2  0  4  1  0  0  1  0  3  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,21

## ITERATION 188 #######################


> Neighbours evaluated; 26
> Selected Move:	2370	3	9	4	18800


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,205

## ITERATION 189 #######################


> Neighbours evaluated; 27
> Selected Move:	2520	3	8	1	16500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  0 


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 190 #######################


> Neighbours evaluated; 27
> Selected Move:	2540	3	2	5	18500


> New Y[]: 
	
	 2  3  0  1  1  4  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  1  1  0  0  0 
 > pw :0,195

## ITERATION 191 #######################


> Neighbours evaluated; 25
> Selected Move:	2480	3	4	7	17500


> New Y[]: 
	
	 2  3  0  1  0  4  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 192 #######################


> Neighbours evaluated; 26
> Selected Move:	2480	4	5	3	19000


> New Y[]: 
	
	 2  3  0  4  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 193 #######################


> Neighbours evaluated; 29
> Selected Move:	2480	4	3	6	19000


> New Y[]: 
	
	 2  3  0  1  0  1  4  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 194 #######################


> Neighbours evaluated; 27
> Selected Move:	2480	4	6	7	19200


> New Y[]: 
	
	 2  3  0  1  0  1  1  4  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,175

## ITERATION 195 #######################


> Neighbours evaluated; 26
> Selected Move:	2330	3	3	4	19200


> New Y[]: 
	
	 2  3  0  0  1  1  1  4  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,17

## ITERATION 196 #######################


> Neighbours evaluated; 27
> Selected Move:	2330	4	7	4	18700


> New Y[]: 
	
	 2  3  0  0  4  1  1  1  0  0 


> New S[]: 
	
	 1  0  0  0  0  1  0  0  0  0 
 > pw :0,165

## ITERATION 197 #######################


> Neighbours evaluated; 27
> Selected Move:	2385	3	1	9	20700


> New Y[]: 
	
	 2  0  0  0  4  1  1  1  0  3 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,16

## ITERATION 198 #######################


> Neighbours evaluated; 25
> Selected Move:	2356	4	9	6	20900


> New Y[]: 
	
	 2  0  0  0  4  1  3  1  0  1 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,155

## ITERATION 199 #######################


> Neighbours evaluated; 25
> Selected Move:	2438	4	4	9	20400


> New Y[]: 
	
	 2  0  0  0  1  1  3  1  0  4 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 200 #######################


> Neighbours evaluated; 25
> Selected Move:	2420	3	4	3	20400


> New Y[]: 
	
	 2  0  0  1  0  1  3  1  0  4 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1 
 > pw :0,145

## ITERATION 201 #######################


> Neighbours evaluated; 24
> Selected Move:	2422	3	9	4	20400


> New Y[]: 
	
	 2  0  0  1  4  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,15

## ITERATION 202 #######################


> Neighbours evaluated; 25
> Selected Move:	2375	4	4	3	20700


> New Y[]: 
	
	 2  0  0  4  1  1  3  1  0  0 


> New S[]: 
	
	 1  0  0  0  1  0  0  0  0  0 
 > pw :0,155
________________________________________________________________

Best solution found: 3070
Run Termination time: 31.01.2010 10:17:32
Run duration: 00:00:40.2187500
________________________________________________________________
